Biased Leftist Trees and Modi ed Skip Lists
نویسندگان
چکیده
We propose the weight biased leftist tree as an alternative to traditional leftist trees CRAN for the representation of mergeable priority queues A modi ed version of skip lists PUGH that uses xed size nodes is also proposed Experimental results show our modi ed skip list structure is faster than the original skip list structure for the representation of dictionaries Experimental results comparing weight biased leftist trees and competing priority queue structures as well as experimental results for double ended priority queues are presented
منابع مشابه
Skip Trees, an Alternative Data Structure to Skip Lists in a Concurrent Approach
We present a new type of search trees, called Skip trees, which are a generalization of Skip lists. To be precise, there is a one-to-one mapping between the two data types which commutes with the sequential update algorithms. A Skip list is a data structure used to manage data bases which stores values in a sorted way and in which it is insured that the form of the Skip list is independent of t...
متن کاملBiased Skip Lists 1
We design a variation of skip lists that performs well for generally biased access sequences. Given n items, each with a positive weight wi , 1 ≤ i ≤ n, the time to access item i is O(1 + log(W/wi )), where W =∑n i=1 wi ; the data structure is dynamic. We present two instantiations of biased skip lists, one of which achieves this bound in the worst case, the other in the expected case. The stru...
متن کاملBiased Skip Lists for Highly Skewed Access Patterns
1 Dynamic tables that support search, insert and delete operations are fundamental and well studied in computer science. There are many well known data structures that solve this problem, including balanced binary trees, skip lists and tries among others. Many of the existing data structures work efficiently when the access patterns are uniform, but in many circumstance access patterns are bias...
متن کاملA New Weight Balanced Binary Search Tree 1
We develop a new class of weight balanced binary search trees called-balanced binary search trees (-BBSTs).-BBSTs are designed to have reduced internal path length. As a result, they are expected to exhibit good search time characteristics. Individual search, insert, and delete operations in an n node-BBST take O(log n) time for 0 < p 2?1. Experimental results comparing the performance of-BBSTs...
متن کاملFinger Search Trees
University of Aarhus 11.1 Finger Searching. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11-1 11.2 Dynamic Finger Search Trees . . . . . . . . . . . . . . . . . . . . . . . 11-2 11.3 Level Linked (2,4)-Trees . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11-3 11.4 Randomized Finger Search Trees . . . . . . . . . . . . . . . . . . . 11-4 Treaps • Skip ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009